Possibilistic logic representation of preferences: relating prioritized goals and satisfaction levels expressions
نویسندگان
چکیده
The preferences of an agent can be expressed in various ways. The agent may indicate goals having different levels of priority for him, or provides classes of choices with their level of satisfaction for him. The first type of specification can be captured in possibilistic logic under the form of constraints on a necessity measure. It is shown in this paper that the second manner for expressing preferences can be encoded as constraints on a so-called ”guaranteed possibility” measure (a min-decomposable function with respect to disjunction). The paper shows how each representation is semantically associated with a possibility distribution (which plays the role of a value function), and how necessity-based possibilistic logic representations can be translated directly into a guaranteed possibilitybased representations and vice-versa. In logical terms, it corresponds to the transformation of a generalized CNF into a generalized DNF. Reasoning in guaranteed possibility-based logic is also discussed. Moreover, the two types of representations can also be shown to be equivalent to sets of conditional preference statements. Thus, different basic modes of preference expression can be captured in the same framework.
منابع مشابه
A possibilistic logic machinery for qualitative decision
This paper describes a logical machinery for computing decisions, where the available knowledge on the state of the world is described by a possibilistic propositional logic base (i.e., a collection of logical statements associated with qualitative certainty levels), and where the preferences of the user are also described by another possibilistic logic base whose formula weights are interprete...
متن کاملA Possibilistic Argumentation Decision Making Framework with Default Reasoning
In this paper, we introduce a possibilistic argumentation-based decision making framework which is able to capture uncertain information and exceptions/defaults. In particular, we define the concept of a possibilistic decision making framework which is based on a possibilistic default theory, a set of decisions and a set of prioritized goals. This set of goals captures user preferences related ...
متن کاملLogical representation and computation of optimal decisions in
This paper describes a logical machinery for computing decisions based on an ATMS procedure, where the available knowledge on the state of the world is described by a possibilistic propositional logic base (i.e., a collection of logical statements associated with qualitative certainty levels). The preferences of the user are also described by another possibilistic logic base whose formula weigh...
متن کاملLogical Representation and Computation of Optimal Decisions in a Qualitative Setting
This paper describes a logical machinery for computing decisions based on an ATMS procedure, where the available knowledge on the state of the world is described by a possibilistic propositional logic base (i.e., a collection of logical statements associated with qualitative certainty levels). The preferences of the user are also described by another possibilistic logic base whose formula weigh...
متن کاملFuzzy Constraint Problems with General Aggregation Operations under Possibilistic Logic Form
In Fuzzy constraints satisfaction problem (FCSP), fuzzy constraints are aggregated by min operation into a fuzzy set membership function to be maximized. This representation framework, originally expressed in terms of membership functions, can be equivalently translated into a set of prioritized crisp constraints. We take advantage of this representation for modeling aggregations different from...
متن کامل